Sequence Alignment with Weighted Constraints
نویسندگان
چکیده
Given two sequences S1, S2 and a constrained sequence C, the longest common subsequence of S1, S2 with restriction to C is defined as the constrained longest common subsequence (CLCS) of S1, S2 and C. At the same time, the best alignment of S1, S2 with restriction to C is defined as the constrained pairwise sequence alignment (CPSA) of S1, S2 and C. Previous algorithms have shown that both CLCS and CPSA can be solved in O(rnm) time using similar dynamic programming formulas, where r = |C|, n = |S1| and m = |S2|. In 2004, Arslan first extended the definition of CLCS to a more flexible version, where the number of ignored constraints is allowed to a degree d and time complexity increases to O(drnm). In this paper, we extend the definition of CPSA to another version, called weighted CPSA (WCPSA), and show that WCPSA can not only be solved in O(rnm) time but also allow ignoring constraints by setting proper weights. In addition, we also show that some constraint-related problems can be immediately solved by adopting WCPSA.
منابع مشابه
An Algorithm and Applications to Sequence Alignment with Weighted Constraints
Given two sequences S1, S2, and a constrained sequence C, a longest common subsequence of S1, S2 with restriction to C is called a constrained longest common subsequence of S1 and S2 with C. At the same time, an optimal alignment of S1, S2 with restriction to C is called a constrained pairwise sequence alignment of S1 and S2 with C. Previous algorithms have shown that the constrained longest co...
متن کاملAn Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملNon-approximability of Weighted Multiple Sequence Alignment
We consider a weighted generalization of multiple sequence alignment with sumof-pair score. Multiple sequence alignment without weights is known to be NPcomplete and can be approximated within a constant factor, but it is unknown whether it has a polynomial time approximation scheme. Weighted multiple sequence alignment can be approximated within a factor of O(log n) where n is the number of se...
متن کاملNon-approximability of weighted multiple sequence alignment for arbitrary metrics
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one.
متن کامل